Decompositions of regular graphs into Knc ∨ 2K2
نویسندگان
چکیده
منابع مشابه
Large regular graphs with no induced 2K2
Let r be a positive integer. Consider r-regular graphs in which no induced subgraph on four vertices is an independent pair of edges. The number v of vertices in such a graph does not exceed 5r/2; this proves a conjecture of Bermond. More generally, it is conjectured that if v > 2r, then the ratio v/r must be a rational number of the form 2 + 1/(2k). This is proved for v/r > 21 _ ~ . The extrem...
متن کاملDecompositions of Complete Graphs into Bipartite 2-Regular Subgraphs
It is shown that if G is any bipartite 2-regular graph of order at most n2 or at least n − 2, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order n into a perfect matching and edge-disjoint copies of G.
متن کاملCompatible circuit decompositions of 4-regular graphs
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition C of G is compatible with T if no pair of adjacent edges of G is both a transition of T and consecutive in a circuit of C. We give a conjectured characterization of when a 4-regular graph has a transition system which...
متن کاملA result on decompositions of regular graphs
Su, X.-Y., A result on decompositions of regular graphs, Discrete Mathematics 105 (1992) 323-326. We prove that for any connected graph G and any integer r which is a common multiple of the degrees of the vertices in G, there exists a connected, r-regular, and G-decomposable graph H such that x(H) = x(G) and o(H) = w(G), where x and w are the chromatic number and the clique number, respectively...
متن کاملCp-decompositions of some regular graphs
In this paper, for any prime p 11, we consider Cp-decompositions of Km × Kn and Km ∗ Kn and also Cp-factorizations of Km × Kn, where × and ∗ denote the tensor product and wreath product of graphs, respectively, (Km ∗ Kn is isomorphic to the complete m-partite graph in which each partite set has exactly n vertices). It has been proved that for m, n 3, Cp-decomposes Km ×Kn if and only if (1) eith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00026-f